Search results for "010103 numerical & computational mathematics"

Error identities for variational problems with obstacles

2017

Аппроксимации по мере: задача Дирихле, универсальность и гипотеза Римана

2021

Аппроксимации по мере используются для решения асимптотической задачи Дирихле на произвольных открытых множествах, а также для демонстрации того обстоятельства, что многие функции, в том числе дзета-функция Римана, универсальны в смысле сходимости по мере. Выдвигается предположение о связи этих результатов с гипотезой Римана. Библиография: 12 наименований.

Removing the saturation assumption in Bank-Weiser error estimator analysis in dimension three

2020

International audience; We provide a new argument proving the reliability of the Bank-Weiser estimator for Lagrange piecewise linear finite elements in both dimension two and three. The extension to dimension three constitutes the main novelty of our study. In addition, we present a numerical comparison of the Bank-Weiser and residual estimators for a three-dimensional test case.

Mathematical modelling of the feed rod shape in floating zone silicon crystal growth

2017

Abstract A three-dimensional (3D) transient multi-physical model of the feed rod melting in the floating zone (FZ) silicon single-crystal growth process is presented. Coupled temperature, electromagnetic (EM), and melt film simulations are performed for a 4 inch FZ system, and the time evolution of the open melting front is studied. The 3D model uses phase boundaries and parameters from a converged solution of a quasi-stationary axisymmetric (2D) model of the FZ system as initial conditions for the time dependent simulations. A parameter study with different feed rod rotation, crystal pull rates and widths of the inductor main slit is carried out to analyse their influence on the evolution …

Stochastic Galerkin method for cloud simulation

2018

AbstractWe develop a stochastic Galerkin method for a coupled Navier-Stokes-cloud system that models dynamics of warm clouds. Our goal is to explicitly describe the evolution of uncertainties that arise due to unknown input data, such as model parameters and initial or boundary conditions. The developed stochastic Galerkin method combines the space-time approximation obtained by a suitable finite volume method with a spectral-type approximation based on the generalized polynomial chaos expansion in the stochastic space. The resulting numerical scheme yields a second-order accurate approximation in both space and time and exponential convergence in the stochastic space. Our numerical results…

Variable neighborhood descent for the incremental graph drawing

2017

Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.

GIS Infomobility for Travellers

2016

Geographical Information Systems (GIS) are essential systems to support decisions on territorial and environmental aspects. But they not always have been properly used for this purpose. Only in recent years GIS have been getting better used for the planning, management and control of the territory. The application of GIS to the transport sector has become relevant both for management and decision-making in support of Public Administration (PA) and citizens. GIS are particularly useful for roads and routing graphs management capabilities as well as for searching the most suitable path. The results achieved in this research activity aimed to evaluate different road graphs, proprietary and fre…

Packing colorings of subcubic outerplanar graphs

2018

Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all sub…

Modeling mass transfer in fracture flows with the time domain-random walk method

2019

The time domain-random walk method was developed further for simulating mass transfer in fracture flows together with matrix diffusion in surrounding porous media. Specifically, a time domain-random walk scheme was developed for numerically approximating solutions of the advection-diffusion equation when the diffusion coefficient exhibits significant spatial variation or even discontinuities. The proposed scheme relies on second-order accurate, central-difference approximations of the advective and diffusive fluxes. The scheme was verified by comparing simulated results against analytical solutions in flow configurations involving a rectangular channel connected on one side with a porous ma…

Varieties of algebras with pseudoinvolution and polynomial growth

2017

Let A be an associative algebra with pseudoinvolution (Formula presented.) over an algebraically closed field of characteristic zero and let (Formula presented.) be its sequence of (Formula presented.) -codimensions. We shall prove that such a sequence is polynomially bounded if and only if the variety generated by A does not contain five explicitly described algebras with pseudoinvolution. As a consequence, we shall classify the varieties of algebras with pseudoinvolution of almost polynomial growth, i.e. varieties of exponential growth such that any proper subvariety has polynomial growth and, along the way, we shall give also the classification of their subvarieties. Finally, we shall de…